Load Balancing by Finite Dimension Exchange Algorithms
نویسنده
چکیده
منابع مشابه
Iterative algorithms for distributed load balancing
We consider the load balancing problem for a synchronous distributed processor network. The processor network is modeled by an undirected, connected graph G = (V;E) in which node vi 2 V possesses a computational load ui. We want to determine a schedule in order to move load across edges so that the weight on each node is approximately equal. This problem models load balancing when we associate ...
متن کاملDimension-Exchange Algorithms for Load Balancing on Trees
This paper considers dimension-exchange algorithms for load balancing on trees with finitely-divisible loads (token distribution). We present improved analysis of an existing protocol, and in particular, establish a logarithmic upper bound on the discrepancy of the final distribution. Our second contribution is a new algorithm, which assuming each node has knowledge of the total number of nodes...
متن کاملAccelerated diffusion algorithms for dynamic load balancing
We consider the load balancing problem for a synchronous distributed processor network. The processor network is modeled by an undirected, connected graph G = (V,E) in which node vi ∈ V possesses a computational load wi. We want to determine a schedule in order to move load across edges so that the weight on each node is approximately equal. This problem models load balancing when we associate ...
متن کاملNearest-neighbor algorithms for load-balancing in parallel computers
With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on localized workload information and manages workload migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms , the dimension-exchange (DE, for short) and the diiusion (DF, for short) methods and their several variants|the average dimension-exch...
متن کاملNearest neighbor algorithms for load balancing inparallel computersChengzhong
With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on localized workload information and manages workload migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms , the dimension-exchange (DE, for short) and the diiusion (DF, for short) methods and their several variants|the average dimension-exch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001